/**
*      author: Y_Yao
*      created: 2024-12-05 22:46:36
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 7;
int a[N];
int n;

void solve()
{
    cin >> n;
    int sum = 0;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        sum += a[i];
    }

    int dest = sum / n;
    for(int i = 1;i <= n - 2;i++)
    {
        if(a[i] > dest)
        {
            int dif = a[i] - dest;
            a[i] = dest;
            a[i + 2] += dif;
        }
        else if(a[i] < dest)
        {
            int dif = dest - a[i];
            a[i] = dest;
            a[i + 2] -= dif;
        }
    }
    for(int i = 1;i <= n;i++)
    {
        if(a[i] != dest)
        {
            cout << "NO" << endl;
            return;
        }
    }

    cout << "YES" << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}